Approximation Limits of Linear Programs (Beyond Hierarchies)
نویسندگان
چکیده
منابع مشابه
Fast Approximation Algorithms for Positive Linear Programs
Fast Approximation Algorithms for Positive Linear Programs by Di Wang Doctor of Philosophy in Computer Science University of California, Berkeley Professor Satish Rao, Chair Positive linear programs (LPs), or equivalently, mixed packing and covering LPs, are LPs formulated with non-negative coefficients, constants, and variables. Notable special cases of positive LPs include packing LPs and cov...
متن کاملBeyond Keywords and Hierarchies
As our ability to store information increases, the mechanisms we employ to access that information become ever more important. In this paper, we present Archosum, a prototype of an organizational system that attempts to encapsulate the benefits of both hierarchical and keyword systems. By introducing abstract entities, Archosum provides a simple interface with which users can build and maintain...
متن کاملOuter approximation algorithms for DC programs and beyond
Acknowledgements This thesis is the result of four years of work whereby I have been accompanied and supported by many people. It is my pleasure that I have now the opportunity to express my gratitude to all of them. Without them, this dissertation would not have been possible. I would like to express my deep and sincere gratitude to my supervisors, Professors Giancarlo Bigi and Antonio Frangio...
متن کاملApproximation Algorithms Based on Lp Relaxation 1 Linear Programs and Linear Integer Programs
There are two fundamental approximation algorithm design techniques based on linear programming: (a) LP-relaxation and rounding, and (b) the primal-dual method. In this lecture note, we will discuss the former. The idea of LP-relaxation and rounding is quite simple. We first formulate an optimization problem as an integer program (IP), which is like a linear program (LP) with integer variables....
متن کاملSuccessive Linear Approximation Solution of Infinite-Horizon Dynamic Stochastic Programs
Models for long-term planning often lead to infinite horizon stochastic programs that offer significant challenges for computation. Finite-horizon approximations are often used in these cases but they may also become computationally difficult. In this paper, we directly solve for value functions of infinite horizon stochastic programs. We show that a successive linear approximation method conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematics of Operations Research
سال: 2015
ISSN: 0364-765X,1526-5471
DOI: 10.1287/moor.2014.0694